Interference Cancellation and Scheduling in Wireless Networks
ثبت نشده
چکیده
SIC (Successive Interference Cancellation) is an effective way of multiple packet reception (MPR) to fight with interference in wireless networks. Most of the existing methods for SIC in wireless networks are mainly focusing on link scheduling. For characterizing the impact of SIC, two interference models such as layered protocol model and layered physical model are introduced. Various existing scheduling schemes are examined for their performance in a network with SIC. To explain the generic behavior of the scheduling schemes, the capacity of a network with SIC is to be analyzed. The scheduling performance investigates two scenarios such as chain and cell topology. In chain topology, the average throughput values are compared with SIC and without SIC. In cell topology, the normalized throughput is compared with number of receiver nodes with different node density. The performance of proposed scheme has been verified using network simulator to show that the approach is efficient.
منابع مشابه
Design of Power and Rate Adaptation with Scheduling In Wireless Networks Based On SIC
To properly evaluate the usage of SIC, a joint design of power and rate adaptation algorithm with scheduling in wireless networks is to be analyzed.SIC (Successive Interference Cancellation) is an effective way of multiple packet reception (MPR) to fight with interference in wireless networks. Power management and high data rate is an important problem in wireless networks. With the help of SIC...
متن کاملMIMO Link Scheduling for Interference Cancellation in Dense Wireless Networks
This paper addresses the problem of fair scheduling of MIMO links in dense wireless network deployments where MIMO interference cancellation is carried out to optimize network performance. We formulate and solve an optimal MIMO link scheduling problem, where the goal is to maximize aggregate throughput while meeting a specified fairness criterion. Evaluations in a modified version of ns-3 show ...
متن کاملContext-aware Greedy Scheduling Algorithm in Wireless Network
In order to measure the link’s interference in static heterogeneous wireless networks, we need to know its context information, but the context information can not be informed before the link allocates the time slot. Because of the highly inadequate collection and the use of traditional scheduling algorithms for link interference information, which severely limits their performance, this paper ...
متن کاملWireless Scheduling with Dominant Interferers and Applications to Femtocellular Interference Cancellation
We consider a general class of wireless scheduling and resource allocation problems where the received rate in each link is determined by the actions of the transmitter in that link along with a single dominant interferer. Such scenarios arise in a range of scenarios, particularly in emerging femtoand picocellular networks with strong, localized interference. For these networks, a utility maxim...
متن کاملInterference-Aware and Cluster Based Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks
Multicast routing is one of the most important services in Multi Radio Multi Channel (MRMC) Wireless Mesh Networks (WMN). Multicast routing performance in WMNs could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. In this paper we want to address the multicast routing problem for a given channel assignment in WMNs. The channels...
متن کامل